COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.require "let.pub" source
C00005 ENDMK
C⊗;
.require "let.pub" source
∂AIL Dr. Patrick Hayes↓Department of Computer Science
↓University of Essex↓P.O. Box 23↓Wivenhoe Park↓Colchester↓England CO4 3SQ∞
Dear Pat:

	Enclosed are five papers, none of which is what your
sources rumor, but I would be glad about your comments on them.
I have just read Kowalski's paper, which he recently sent me, about
predicate calculus as a programming language.  Clearly it can
be used as a programming language, but I am not convinced that it
is an especially useful programming language.  I also don't understand
the relations between Kowalski's formalism and the one described
in my %2First Order Representations of Recursive Programs%1.  I
must explicitly include an undefined element in the domain, and
he doesn't.  On the other hand, I can prove things about partial
functions with the aid of my schema.  Nevertheless, the must be
some kind of translation.  Besides these formalisms, we also need
one in which programs are objects, and I have some incomplete
drafts on this subject based on a notion of %2extensional form%1.

	These drafts may be shown to whomever you like, but anyone
who contemplates referring to them in print - positively or negatively -
should consult me first, because their printed versions may be
different.

.reg